Analysis of half-space range search using the k-d search skip list
نویسندگان
چکیده
1 Abstract We analyse the average cost of half-space range reporting for the k-d search skip list. The k-d search skip list is a dynamic data structure requiring (kn) space for a set of n k-dimensional points. Under the assumption of uniform random distribution of points in k-d space, and a random query hyper-plane, our results show that for the 2-d case, the average running time for half-space range reporting using the k-d search skip list is O(p n + t), where t is the number of reported points. Algorithms for orthogonal range search and half space range search are extensively covered in the literature (e.g. 1, 3, 5, 11, 13]). For a survey of extensive literature on the subject the reader may want to consult 6] or 2]. As mentioned in 14], algorithms for range search traditionally fall into two categories: best worst case search time achievable by a linear space data structure, and minimum storage space to enable polylog (worst case) search time. The algorithm we analyse here falls into the former category. The distribution of multidimensional data is unlikely to occur in patterns leading to worst case range search cases. Expected case analysis of range search algorithms is often a good predictor of their performance (e.g. 4, 7, 10]). The k-d search skip list 9] is a linear space data structure (based on the 1-3 deterministic skip list of 8]) supporting k-d range search in O(kn) time, with dynamic update time of O(k logn). Figure 1 illustrates the eight rectangles of the internal nodes of a 2-d search skip list containing 14 points. Figure 2 shows a simpli-ed version of the 2-d search skip list arising from inserting the 14 points of Figure 1. Notice that each interior node contains the bounding box of all nodes in its down sublist. Here we analyse the expected time for half-space k-d range reporting under the assumption that both the input points and the query hyperplane are randomly and uniformly distributed. In addition, we change the structure of the k-d skip list in two ways, as follows: (1) we use a randomized skip list instead of the deterministic one used in 9], and (2) points are inserted into the list, not by x-coordinate, but by their position along a space-lling curve. These changes result in a simpler analysis and a better average performance. Other than these two changes, the data …
منابع مشابه
OPTIMIZATION OF SKELETAL STRUCTURES USING IMPROVED GENETIC ALGORITHM BASED ON PROPOSED SAMPLING SEARCH SPACE IDEA
In this article, by Partitioning of designing space, optimization speed is tried to be increased by GA. To this end, designing space search is done in two steps which are global search and local search. To achieve this goal, according to meshing in FEM, firstly, the list of sections is divided to specific subsets. Then, intermediate member of each subset, as representative of subset, is defined...
متن کاملImproved Skips for Faster Postings List Intersection
Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...
متن کاملImproved Skips for Faster Postings List Intersection
Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...
متن کاملRange Queries in Non-blocking k-ary Search Trees
We present a linearizable, non-blocking k-ary search tree (k-ST) that supports fast searches and range queries. Our algorithm uses single-word compare-and-swap (CAS) operations, and tolerates any number of crash failures. Performance experiments show that, for workloads containing small range queries, our k-ST significantly outperforms other algorithms which support these operations, and rivals...
متن کاملLeaplist: lessons learned in designing tm-supported range queries Citation
We introduce Leap-List, a concurrent data-structure that is tailored to provide linearizable range queries. A lookup in Leap-List takes O(log n) and is comparable to a balanced binary search tree or to a skip-list. However, in Leap-List, each node holds up-to K immutable key-value pairs, so collecting a linearizable range is K times faster than the same operation performed non-linearizably on a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002